An Efficient Numerical Algorithm for Cracks Partly in Frictionless Contact

NUMERICAL INVESTIGATION OF CRACK ORIENTATION IN THE FRETTING FATIGUE OF A FLAT ROUNDED CONTACT

The growth of slant cracks by fretting fatigue of a half plane in contact with a flat rounded pad was studied. The mode I and mode II stress intensity factors for cracks of various lengths and directions were calculated using the semi-analytical method of the distribution of dislocations, and their cumulative effect on the crack growth was investigated using the strain energy density criterion....

Using Pattern Search Algorithm and Finite Element Method to Detect Rotor Cracks

The vibration pattern of a rotor system reflects the mechanical parameter changes in the system. Hence, the use of vibration monitoring is considered as a possible means of detecting the presence and growth of the cracks. In this paper, a pattern search based method for shaft crack detection is proposed and described which formulates the shaft crack detection as an optimization problem by means...

On Stationary and Moving Interface Cracks with Frictionless Contact in Anisotropic Bimaterials

A Frictionless Contact Algorithm for Deformable Bodies

This article is devoted to the presentation of a new contact algorithm for bodies undergoing finite deformations. We only address the kinematic aspect of the contact problem, that is the numerical treatment of the non-intersection constraint. In consequence, mechanical aspects like friction, adhesion or wear are not investigated and we restrict our analysis to the simplest frictionless case. On...

A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution

In this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...